A non-recursive technique for recreating a digraph from its K-formula representation

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Iterative Method for Recreating a Binary Tree from its Traversals

Many reconstruction algorithms for binary tree have been discussed in this paper. A particular focus of this paper is on “A new Non-Recursive Algorithm for Reconstructing a Binary Tree from its Traversals”. The computation time required for executing the reconstruction algorithm are O(N) and space complexity is O(NlogN) where N is the number of nodes in the binary tree. This algorithm works wel...

متن کامل

a recursive formula for the number of fuzzy subgroups of finite cyclic groups

fuzzy groups and fuzzy theory have a lot of applications in several sciences such as mathematics, computer science, computer and electrical engineering. hence, counting the number of fuzzy subgroups of finite groups to classify them is an important issue in fuzzy theory. the main goal of this paper is to give an explicit formula for the number of fuzzy subgroups of a finite cyclic group g z p1 ...

متن کامل

Algebraic properties of a digraph and its line digraph

Let G be a digraph, LG its line digraph and A(G) and A(LG) their adjacency matrices. We present relations between the Jordan Normal Form of these two matrices. Besides, we study the spectra of those matrices and obtain a relationship between their characteristic polynomials that allows to relate properties of G and LG regarding the number of cycles of a given length.

متن کامل

Dihedral Butterfly Digraph and Its Cayley Graph Representation

In this paper, we present a new extension of the butterfly digraph, which is known as one of the topologies used for interconnection networks. The butterfly digraph was previously generalized from binary to d-ary. We define a new digraph by adding a signed label to each vertex of the d-ary butterfly digraph. We call this digraph the dihedral butterfly digraph and study its properties. Furthermo...

متن کامل

a recursive formula for the number of fuzzy subgroups of finite cyclic groups

fuzzy groups and fuzzy theory have a lot of applications in several sciencessuch as mathematics, computer science, computer and electrical engineering.hence, counting the number of fuzzy subgroups of finite groups to classify them isan important issue in fuzzy theory. the main goal of this paper is to give an explicitformula for the number of fuzzy subgroups of a finite cyclic groupg z p1 z p 2...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Computer Journal

سال: 1976

ISSN: 0010-4620,1460-2067

DOI: 10.1093/comjnl/19.4.326